/***************************************************************************
 *   Copyright (C) 2007 by Ivan Vasić              *
 *   ivasic@gmail.com                  *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 *   This program is distributed in the hope that it will be useful,       *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
 *   GNU General Public License for more details.                          *
 *                                                                         *
 *   You should have received a copy of the GNU General Public License     *
 *   along with this program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************/
#include "bdictnode.h"
#include "bvaluenode.h"
#include "bnode.h"
		
#include <QByteArray>
#include <QMap>
#include <QDebug>
		
BDictNode::BDictNode(quint32 offset)
		: BNode(offset, DICT)
{}


BDictNode::~BDictNode()
{}

void BDictNode::insert(BValueNode * key, BNode * data)
{
	m_children.insert(key, data);
}


const BNode* BDictNode::value(BValueNode* key) const
{
	return m_children.value(key);
}

const BNode* BDictNode::value(const QString& key) const
{
	BValueNode* n;
	BNode* ret = 0l;
	
	QMapIterator<BValueNode*, BNode*> i(m_children);
 	while (i.hasNext()) 
	{
		i.next();		
		n = i.key();		
		if(n->type() == BValueNode::STRING)
		{
			if(n->value().toString() == key)
			{
				ret = i.value();
				break;
			}
		}
 	}
	
	return ret;
}
